搜索资源列表
Dijkstra
- Dijkstra shortest path algorithm universal Matlab program
Dijkstra
- 迪杰斯克拉无向图最短路径----dijkstra 这是帮同学完成的Project，老外老师的要求果然不同。对于基本算法，不光要求不能使用高级容器类，还要求程序有一定的检验错误能力。花了1天的时间写完，代码考虑结点过多内存占用的问题，因此关系矩阵采用映射的方式存储。由此带来的弊端是，找一个结点的时候需要循环判断，导致效率过低。总之，内存占用与程序效率是鱼与熊掌不可兼得。 代码写的比较凌乱。仅供参考。 Project的要求介绍参考链接： http://hi.baidu.com/
Dijkstra
- 通用Matlab实现Dijkstra最短路算法-General Matlab achieve Dijkstra shortest path algorithm
T002-Dijkstra
- T002_最短路径Dijkstra算法及实现-Dijkstra shortest path algorithm and implementation
Dijkstra
- 任意给定图，10个结点以上，实现图，并用迪杰斯特拉算法求最短路径 注：在D盘存放节点之间的权值-Any given map, more than 10 nodes to achieve chart, and use Dijkstra shortest path algorithm
Dijkstra
- Dijkstra算法求最短路径，通过读取TXT数据，显示计算机过，快速且精准-Dijkstra shortest path algorithm, by reading TXT data over a computer display, fast and accurate
Dijkstra
- Dijkstra最短路径算法，C++实现，编译环境为VS2010，中间需要自己调试。-Dijkstra shortest path algorithm, C++, the compiler environment for VS2010, intermediate needs its own debugging.
matlab-Dijkstra
- 此代码是在matlab环境下用Dijkstra算法求最短路径，希望对大家有帮助-This code is used Dijkstra shortest path algorithm matlab environment, we hope to help
Prim-And-Dijkstra
- 这个程序是图的综合操作中的最小生成树中普利姆算法和最短路径迪杰斯特拉算法的代码！-This program is a comprehensive diagram of the operation of the minimum spanning tree algorithm and plym Dijkstra shortest path algorithm code!
shortest
- 使用迪杰斯特拉求最短路径算法。用到了VC++6.0开发工具-Use Dijkstra shortest path algorithm. Used the VC++ 6.0 development tools
Shortest Path using Dijkstra
- Shortest Path using Dijkstra algorithm
Dijkstra
- C语言实现Dijkstra最短路径算法，按要求输出邻接矩阵，并显示源点到目的地所经过的所以节点和总距离。-Dijkstra shortest path algprithm
Dijkstra
- 最短路Dijkstra算法-Dijkstra shortest path algorithm
QPSK_modulation-and-Dijkstra-method
- 介绍了qpsk调制解调及Dijkstra最短路径算法，并给出了仿真的结果和程序。-Introduced qpsk modem and Dijkstra shortest path algorithm, and the simulation results and procedures.
Dijkstra
- 本算法用于查找最短路径，使用了数据结构中的dijkstra最短路径算法，并且在程序的最后输出了最短路径和经过的长度。- The algorithm for finding the shortest path, use the data structure dijkstra shortest path algorithm, and in the final output of the program and through the shortest path length.
dijkstra
- 迪杰斯特拉算法计算最短路径Dijkstra算法是由E.W.Dijkstra于1959年提出，又叫迪杰斯特拉算法，它应用了贪心算法模式，是目前公认的最好的求解最短路径的方法。算法解决的是有向图中单个源点到其他顶点的最短路径问题，其主要特点是每次迭代时选择的下一个顶点是标记点之外距离源点最近的顶点。但由于dijkstra算法主要计算从源点到其他所有点的最短路径，所以算法的效率较低。-Dijkstra shortest path algorithm Dijkstra algorithm is prop
dijkstra
- 基于Dijkstra算法的最短路径问题，有效地解决了2维的问题-Based on Dijkstra shortest path algorithm, effectively solve the problem of two-dimensional
dijkstra
- Dijkstra shortest path algorithm in order to calculate the source to all other vertices of the shortest path length. Implementation is in Java-Dijkstra shortest path algorithm in order to calculate the source to all other vertices of the shortes
patt-shortest
- VB write Dijkstra shortest path selection algorithm
Dijkstra算法
- 迪杰斯特拉算法求最短路径距离，可用于流形测地距离计算中。(Dijkstra algorithm for the shortest path distance, can be used for manifold geodesic distance calculation.)